90 research outputs found
Model checking coalitional games in shortage resource scenarios
Verification of multi-agents systems (MAS) has been recently studied taking
into account the need of expressing resource bounds. Several logics for
specifying properties of MAS have been presented in quite a variety of
scenarios with bounded resources. In this paper, we study a different
formalism, called Priced Resource-Bounded Alternating-time Temporal Logic
(PRBATL), whose main novelty consists in moving the notion of resources from a
syntactic level (part of the formula) to a semantic one (part of the model).
This allows us to track the evolution of the resource availability along the
computations and provides us with a formalisms capable to model a number of
real-world scenarios. Two relevant aspects are the notion of global
availability of the resources on the market, that are shared by the agents, and
the notion of price of resources, depending on their availability. In a
previous work of ours, an initial step towards this new formalism was
introduced, along with an EXPTIME algorithm for the model checking problem. In
this paper we better analyze the features of the proposed formalism, also in
comparison with previous approaches. The main technical contribution is the
proof of the EXPTIME-hardness of the the model checking problem for PRBATL,
based on a reduction from the acceptance problem for Linearly-Bounded
Alternating Turing Machines. In particular, since the problem has multiple
parameters, we show two fixed-parameter reductions.Comment: In Proceedings GandALF 2013, arXiv:1307.416
Unitary Noise and the Mermin-GHZ Game
Communication complexity is an area of classical computer science which
studies how much communication is necessary to solve various distributed
computational problems. Quantum information processing can be used to reduce
the amount of communication required to carry out some distributed problems. We
speak of pseudo-telepathy when it is able to completely eliminate the need for
communication. Since it is generally very hard to perfectly implement a quantum
winning strategy for a pseudo-telepathy game, quantum players are almost
certain to make errors even though they use a winning strategy. After
introducing a model for pseudo-telepathy games, we investigate the impact of
erroneously performed unitary transformations on the quantum winning strategy
for the Mermin-GHZ game. The question of how strong the unitary noise can be so
that quantum players would still be better than classical ones is also dealt
with
Mixed Nash equilibria in selfish routing problems with dynamic constraints
AbstractWe study the problem of routing traffic through a congested network consisting of m parallel links, each having a certain speed. Moreover, we are given n selfish (non-cooperative) agents, each of them willing to route her own piece of traffic on exactly one link. Agents are selfish in that they only pick a link which minimize the delay of their own piece of traffic. In this context much effort has been lavished in the framework of mixed Nash equilibria where the agent’s routing choices are regulated by probability distributions, one for each agent, which let the system thus enter a steady state from which no agent is willing to unilaterally deviate. In this work we consider situations in which some agents have constraints on the routing choice: in a sense they are forbidden to route their traffic on some links. We show that at most one Nash equilibrium may exist and, in some cases with equal speed links and where each agent is forbidden to route on at most one link, we give necessary and sufficient conditions on its existence; these conditions correlate the traffic load of the agents. We consider also a dynamic behaviour of the network when the constraints may vary, in particular when a constraint is removed: we establish under which conditions the network is still in equilibrium. These conditions are all effective in the sense that, given a set of yes/no routing constraints on each link for each agent, we provide the probability distributions corresponding to the unique Nash equilibrium associated to the constraints (if it exists). Moreover these conditions and the possible Nash equilibrium are computed in time O(mn)
Enriched MU-Calculi Module Checking
The model checking problem for open systems has been intensively studied in
the literature, for both finite-state (module checking) and infinite-state
(pushdown module checking) systems, with respect to Ctl and Ctl*. In this
paper, we further investigate this problem with respect to the \mu-calculus
enriched with nominals and graded modalities (hybrid graded Mu-calculus), in
both the finite-state and infinite-state settings. Using an automata-theoretic
approach, we show that hybrid graded \mu-calculus module checking is solvable
in exponential time, while hybrid graded \mu-calculus pushdown module checking
is solvable in double-exponential time. These results are also tight since they
match the known lower bounds for Ctl. We also investigate the module checking
problem with respect to the hybrid graded \mu-calculus enriched with inverse
programs (Fully enriched \mu-calculus): by showing a reduction from the domino
problem, we show its undecidability. We conclude with a short overview of the
model checking problem for the Fully enriched Mu-calculus and the fragments
obtained by dropping at least one of the additional constructs
On the Expressiveness of Markovian Process Calculi with Durational and Durationless Actions
Several Markovian process calculi have been proposed in the literature, which
differ from each other for various aspects. With regard to the action
representation, we distinguish between integrated-time Markovian process
calculi, in which every action has an exponentially distributed duration
associated with it, and orthogonal-time Markovian process calculi, in which
action execution is separated from time passing. Similar to deterministically
timed process calculi, we show that these two options are not irreconcilable by
exhibiting three mappings from an integrated-time Markovian process calculus to
an orthogonal-time Markovian process calculus that preserve the behavioral
equivalence of process terms under different interpretations of action
execution: eagerness, laziness, and maximal progress. The mappings are limited
to classes of process terms of the integrated-time Markovian process calculus
with restrictions on parallel composition and do not involve the full
capability of the orthogonal-time Markovian process calculus of expressing
nondeterministic choices, thus elucidating the only two important differences
between the two calculi: their synchronization disciplines and their ways of
solving choices
Time Aware Knowledge Extraction for Microblog Summarization on Twitter
Microblogging services like Twitter and Facebook collect millions of user
generated content every moment about trending news, occurring events, and so
on. Nevertheless, it is really a nightmare to find information of interest
through the huge amount of available posts that are often noise and redundant.
In general, social media analytics services have caught increasing attention
from both side research and industry. Specifically, the dynamic context of
microblogging requires to manage not only meaning of information but also the
evolution of knowledge over the timeline. This work defines Time Aware
Knowledge Extraction (briefly TAKE) methodology that relies on temporal
extension of Fuzzy Formal Concept Analysis. In particular, a microblog
summarization algorithm has been defined filtering the concepts organized by
TAKE in a time-dependent hierarchy. The algorithm addresses topic-based
summarization on Twitter. Besides considering the timing of the concepts,
another distinguish feature of the proposed microblog summarization framework
is the possibility to have more or less detailed summary, according to the
user's needs, with good levels of quality and completeness as highlighted in
the experimental results.Comment: 33 pages, 10 figure
On Modal {\mu}-Calculus over Finite Graphs with Bounded Strongly Connected Components
For every positive integer k we consider the class SCCk of all finite graphs
whose strongly connected components have size at most k. We show that for every
k, the Modal mu-Calculus fixpoint hierarchy on SCCk collapses to the level
Delta2, but not to Comp(Sigma1,Pi1) (compositions of formulas of level Sigma1
and Pi1). This contrasts with the class of all graphs, where
Delta2=Comp(Sigma1,Pi1)
Model-Checking an Alternating-time Temporal Logic with Knowledge, Imperfect Information, Perfect Recall and Communicating Coalitions
We present a variant of ATL with distributed knowledge operators based on a
synchronous and perfect recall semantics. The coalition modalities in this
logic are based on partial observation of the full history, and incorporate a
form of cooperation between members of the coalition in which agents issue
their actions based on the distributed knowledge, for that coalition, of the
system history. We show that model-checking is decidable for this logic. The
technique utilizes two variants of games with imperfect information and
partially observable objectives, as well as a subset construction for
identifying states whose histories are indistinguishable to the considered
coalition
How do we remember the past in randomised strategies?
Graph games of infinite length are a natural model for open reactive
processes: one player represents the controller, trying to ensure a given
specification, and the other represents a hostile environment. The evolution of
the system depends on the decisions of both players, supplemented by chance.
In this work, we focus on the notion of randomised strategy. More
specifically, we show that three natural definitions may lead to very different
results: in the most general cases, an almost-surely winning situation may
become almost-surely losing if the player is only allowed to use a weaker
notion of strategy. In more reasonable settings, translations exist, but they
require infinite memory, even in simple cases. Finally, some traditional
problems becomes undecidable for the strongest type of strategies
- …